Efficient Level-Based Top-Down Data Cube Computation Using MapReduce

نویسندگان

  • Suan Lee
  • Jinho Kim
  • Yang-Sae Moon
  • Wookey Lee
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Data Cube Analysis over Big Data

Data cubes are widely used as a powerful tool to provide multidimensional views in data warehousing and On-Line Analytical Processing (OLAP). However, with increasing data sizes, it is becoming computationally expensive to perform data cube analysis. The problem is exacerbated by the demand of supporting more complicated aggregate functions (e.g. CORRELATION, Statistical Analysis) as well as su...

متن کامل

Big Data Mining using Map Reduce: A Survey Paper

Big data is large volume, heterogeneous, distributed data. Big data applications where data collection has grown continuously, it is expensive to manage, capture or extract and process data using existing software tools. For example Weather Forecasting, Electricity Demand Supply, social media and so on. With increasing size of data in data warehouse it is expensive to perform data analysis. Dat...

متن کامل

A Scalable Two-Phase Top-DownSpecialization Approach for Data Anonymization Using MapReduce on Cloud

A large number of cloud services require users to share private data like electronic health records for data analysis or mining, bringing privacy concerns. Anonymizing data sets via generalization to satisfy certain privacy requirements such as k-anonymity is a widely used category of privacy preserving techniques. At present, the scale of data in many cloud applications increases tremendously ...

متن کامل

Computing Data Cubes without Redundant Aggregated Nodes and Single Graph Paths: The Sequential MCG Approach

In this paper, we present a novel full cube computation and representation approach, named MCG. A data cube can be defined as a lattice of cuboids. In our approach, each cuboid is seen as a set of sub-graphs. Redundant suffixed nodes in such sub-graphs are quite common, but their elimination is a hard problem as some previous cube approaches demonstrate. MCG approach computes a data cube in two...

متن کامل

Efficient Computation of the Skyline Cube

Skyline has been proposed as an important operator for multi-criteria decision making, data mining and visualization, and userpreference queries. In this paper, we consider the problem of efficiently computing a Skycube, which consists of skylines of all possible non-empty subsets of a given set of dimensions. While existing skyline computation algorithms can be immediately extended to computin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Trans. Large-Scale Data- and Knowledge-Centered Systems

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2015